A note on the random greedy triangle-packing algorithm
نویسندگان
چکیده
منابع مشابه
A note on the random greedy triangle-packing algorithm
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the edges of triangles one at a time, where each triangle removed is chosen uniformly at random from the collection of all remaining triangles. This stochastic process terminates once it arrives at a triangle-free graph. In ...
متن کاملOn Random Greedy Triangle Packing
The behaviour of the random greedy algorithm for constructing a maximal packing of edgedisjoint triangles on n points (a maximal partial triple system) is analysed with particular emphasis on the final number of unused edges. It is shown that this number is at most n, “halfway” from the previous best-known upper bound o(n) to the conjectured value n. The more general problem of random greedy pa...
متن کاملRandom greedy triangle-packing beyond the 7/4 barrier
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. Begin with a complete graph on n vertices and proceed to remove the edges of triangles one at a time, where each triangle removed is chosen uniformly at random out of all remaining triangles. This stochastic process terminates once it arrives at a triangle-free graph, and a longstanding ope...
متن کاملA note on the random greedy independent set algorithm
Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D > N ǫ for some ǫ > 0. Consider the random greedy algorithm for forming an independent set in H. An independent set is chosen at random by iteratively choosing vertices at random to be in the independent set. At each step we chose a vertex uniformly at random from the collection of vert...
متن کاملA note on random greedy coloring of uniform hypergraphs
The smallest number of edges forming an n-uniform hypergraph which is not r-colorable is denoted by m(n, r). Erdős and Lovász conjectured thatm(n, 2) = θ (n2n). The best known lower boundm(n, 2) = Ω (√ n/ logn2n ) was obtained by Radhakrishnan and Srinivasan in 2000. We present a simple proof of their result. The proof is based on analysis of random greedy coloring algorithm investigated by Plu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2010
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2010.v1.n4.a5